Birth of a Strongly Connected Giant in an Inhomogeneous Random Digraph
نویسندگان
چکیده
منابع مشابه
Birth of a Strongly Connected Giant in an Inhomogeneous Random Digraph
We present and investigate a general model for inhomogeneous random digraphs with labeled vertices, where the arcs are generated independently, and the probability of inserting an arc depends on the labels of its endpoints and its orientation. For this model the critical point for the emergence of a giant component is determined via a branching process approach. key words: inhomogeneous digraph...
متن کاملThe Investigation of Giant Magneto Resistance in an Inhomogeneous Ladder Lattice
Abstract : The variation of the electrical resistivity of a material in the externalmagnetic field is known as magneto resistance. This phenomenon has been attractedboth theoretical and experimental researchers in miniaturization of magneto meters inthe recent years. In this paper, the magneto resistance of an inhomogeneous twodimensional conductor with ladder geometry i...
متن کاملOn spectral radius of strongly connected digraphs
It is known that the directed cycle of order $n$ uniquely achieves the minimum spectral radius among all strongly connected digraphs of order $nge 3$. In this paper, among others, we determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $nge 4$.
متن کاملRelations between connected and self-avoiding walks in a digraph
Walks in a directed graph can be given a partially ordered structure that extends to possibly unconnected objects, called hikes. Studying the incidence algebra on this poset reveals unsuspected relations between walks and self-avoiding hikes. These relations are derived by considering truncated versions of the characteristic polynomial of the weighted adjacency matrix, resulting in a collection...
متن کاملThe Transitive Closure of a Random Digraph
In a random n-vertex digraph, each arc is present with probability p, independently of the presence or absence of other arcs. We investigate the structure of the strong components of a random digraph and present an algorithm for the construction of the transitive closure of a random digraph. We show that, when n is large and np is equal to a constant c greater than 1, it is very likely that all...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 2012
ISSN: 0021-9002,1475-6072
DOI: 10.1017/s0021900200009402